Huh, the more features I add to my personal site, the slower the total build time. Adding the tagging feature increased the build time to around 10s. But who cares, I only build the site when I need to deploy, I don't need to build during development and testing.
The codebase has gotten quite a mess though. Anyway, it's mostly temporary, throwaway code that it will change according to my ephemeral whims.
I now have a roughly working algorithm for finding a factor given a number, and by extension, testing whether a given number is prime. It doesn't involve testing against a (possibly large) set of numbers. It's largely a conjecture if it holds for all numbers. I'm still working through examples that I think could be a counter-example, and thus prove the conjecture wrong. Since I'm not a mathematician, it's a long way for me to be able to formulate a mathematical proof. For now, finding counter-examples is easier.
The question is, will it be any better than the current algorithms? I don't know, depends on the complexity of finding the common factors between a number. I think gcd is pretty fast. Fast or not, it doesn't matter, it would be cool enough to create my own algorithm.
